Efficient algorithms for large-scale local triangle counting

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Algorithms for Approximate Triangle Counting

Counting the number of triangles in a graph has many important applications in network analysis. Several frequently computed metrics like the clustering coefficient and the transitivity ratio need to count the number of triangles in the network. Furthermore, triangles are one of the most important graph classes considered in network mining. In this paper, we present a new randomized algorithm f...

متن کامل

Efficient Algorithms for Large-Scale Temporal Aggregation

The ability to model time-varying natures is essential to many database applications such as data warehousing and mining. However, the temporal aspects provide many unique characteristics and challenges for query processing and optimization. Among the challenges is computing temporal aggregates, which is complicated by having to compute temporal grouping. In this paper, we introduce a variety o...

متن کامل

Efficient algorithms for dualizing large-scale hypergraphs

A hypergraph F is a set family defined on vertex set V . The dual of F is the set of minimal subsetsH of V such that F∩H 6= ∅ for any F ∈ F . The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset family, minimal set cover enumeration, and the enumeration of hypergraph transversals. Although many algorithms have been proposed for solving ...

متن کامل

Efficient Algorithms for Large-Scale Image Analysis

The past decade has seen major improvements in the capabilities and availability of imaging sensor systems. Commercial satellites routinely provide panchromatic images with sub-meter resolution. Airborne line scanner cameras yield multi-spectral data with a ground sample distance of 5 cm. The resulting overabundance of data brings with it the challenge of timely analysis. Fully automated proces...

متن کامل

Efficient Cardinality Counting for Large-scale Rfid Systems

Efficient Cardinality Counting for Large-scale RFID Systems

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data

سال: 2010

ISSN: 1556-4681,1556-472X

DOI: 10.1145/1839490.1839494